Bottom-up transfer in Example-based Machine Translation
نویسندگان
چکیده
This paper describes the transfer component of a syntax-based Example-based Machine Translation system. The source sentence parse tree is matched in a bottom-up fashion with the source language side of a parallel example treebank, which results in a target forest which is sent to the target language generation component. The results on a 500 sentences test set are compared with a top-down approach to transfer of the same system, with the bottom-up approach yielding much better results.
منابع مشابه
Top-Down Transfer in Example-based MT
In this paper we describe and evaluate a top-down transfer component of a hybrid example-based machine translation system with an architecture similar to that of transfer MT systems, but with automatically derived transfer-rules and dictionary entries based on a parallel treebank. The tests were applied on the translation pair Dutch to English. Evaluation and error analysis have shown that the ...
متن کاملExample-based Machine Translation Based on Syntactic Transfer with Statistical Models
This paper presents example-based machine translation (MT) based on syntactic transfer, which selects the best translation by using models of statistical machine translation. Example-based MT sometimes generates invalid translations because it selects similar examples to the input sentence based only on source language similarity. The method proposed in this paper selects the best translation b...
متن کاملExample-Based Machine Translation: A New Paradigm
Machine translation (MT) is aimed to enable a computer to transfer natural language utterances in either text or speech from one language into another while preserving the meaning and interpretation. MT technology has gone through several paradigms from its very beginning in the past half century, including word-to-word direct translation, rule-based transfer approach, inter-lingua approach and...
متن کاملIncremental Translation Utilizing Constituent Boundary Patterns
We have proposed an incremental translation method in Transfer-Driven Machine Translation (TDMT). In this method, constituent boundary patterns are applied to an input in a bottom-up fashion. Also, by dealing with best-only substructures, the explosion of structural ambiguity is constrained and an efficient translation of a lengthy input can be achieved. Through preliminary experimentation our ...
متن کاملComputing Transfer Score in Example-Based Machine Translation
This paper presents an idea in Example-Based Machine Translation computing the transfer score for each produced translation. When an EBMT system nds an example in the translation memory, it tries to modify the sentence in order to produce the best possible translation of the input sentence. The user of the system, however, is unable to judge the quality of the translation. This problem can be s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010